منابع مشابه
Decomposing Random Mechanisms
Random mechanisms have been used in real-life situations for reasons such as fairness. Voting and matching are two examples of such situations. We investigate whether desirable properties of a random mechanism survive decomposition of the mechanism as a lottery over deterministic mechanisms that also hold such properties. To this end, we represent properties of mechanisms—such as ordinal strate...
متن کاملDecomposing almost complete graphs by random trees
An old conjecture of Ringel states that every tree with m edges decomposes the complete graph K2m+1. The best lower bound for the order of a complete graph decomposed by a given tree with m edge is O(m). We show that asymptotically almost surely a random tree with m edges and p = 2m + 1 a prime decomposes K2m+1(r) for every r ≥ 2, the graph obtained from the complete graph K2m+1 by replacing ea...
متن کاملDecomposing Random Graphs into Few Cycles and Edges
Over 50 years ago, Erdős and Gallai conjectured that the edges of every graph on n vertices can be decomposed into O(n) cycles and edges. Among other results, Conlon, Fox and Sudakov recently proved that this holds for the random graph G(n, p) with probability approaching 1 as n → ∞. In this paper we show that for most edge probabilities G(n, p) can be decomposed into a union of n4 + np 2 + o(n...
متن کاملApproximate Random Allocation Mechanisms∗
We generalize the scope of random allocation mechanisms, in which the mechanism first identifies a feasible “expected allocation” and then implements it by randomizing over nearby feasible integer allocations. Previous literature had shown that the cases in which this is possible are sharply limited. We show that if some of the feasibility constraints can be treated as goals rather than hard co...
متن کاملDesigning Random Allocation Mechanisms
After an earlier draft was circulated, we were informed that Edmonds (1970) has previously shown that the incidence matrix of a bihierarchical constraint structure is totally unimodular. We include our proof for completeness below. We utilize the following result for our proof. ∗University of Chicago Booth School of Business. Email: [email protected]. †Department of Economics, Columb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Economics
سال: 2015
ISSN: 0304-4068
DOI: 10.1016/j.jmateco.2015.06.002